Uniformly Generating Distribution Functions for Discrete Random Variables
نویسنده
چکیده
An algorithm is presented which, with optimal efficiency, solves the problem of uniform random generation of distribution functions for an n-valued random variable.
منابع مشابه
Probability Generating Functions for Discrete Real Valued Random Variables
The probability generating function is a powerful technique for studying the law of finite sums of independent discrete random variables taking integer positive values. For real valued discrete random variables, the well known elementary theory of Dirichlet series and the symbolic computation packages available nowadays, such as Mathematica 5 TM, allows us to extend to general discrete random v...
متن کاملConstruction of J-variate distribution functions and applications to discrete decision models
The construction of J-variate distribution functions, introducing dependences among J random variables and keeping fixed the J marginal distribution functions, is important in the development of theoretical and empirical statistical analysis. Here, a method for generating such distribution functions is developed. Characteristics of the resulting distribution functions are discussed. An applicat...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملA Fast Method for sampling from Laplacian Type Distributions
This paper deals with the problem of generating samples from a commonly used form of Laplacian distribution. The algorithm was developed particularly for use in generating samples from priors which deene models for images. It is shown that by ranking the independent variables in the distribution, an analytic expression for the Cumulative Density function can be derived. This can be used to gene...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000